Uniform polynomial approximation with A⁎ weights having finitely many zeros
نویسندگان
چکیده
منابع مشابه
Polynomial approximation with doubling weights having finitely many zeros and singularities
We prove matching direct and inverse theorems for (algebraic) polynomial approximation with doubling weights w having finitely many zeros and singularities (i.e., points where w becomes infinite) on an interval and not too “rapidly changing” away from these zeros and singularities. This class of doubling weights is rather wide and, in particular, includes the classical Jacobi weights, generaliz...
متن کاملRepresentations of non-negative polynomials having finitely many zeros
Let K be a basic closed semialgebraic set in R defined by polynomial inequalities g1 ≥ 0, . . . , gs ≥ 0, where g1, . . . , gs ∈ R[x1, . . . , xn], and let f ∈ R[x1, . . . , xn]. In [12], Schmüdgen proves that, if K is compact and f is strictly positive on K, then f belongs to the quadratic preordering generated by g1, . . . , gs. Denote by M the (smaller) quadratic module generated by g1, . . ...
متن کاملReversible languages having finitely many reduced automata
Reversible forms of computations are often interesting from an energy efficiency point of view. When the computation device in question is an automaton, it is known that the minimal reversible automaton recognizing a given language is not necessarily unique, moreover, there are languages having arbitrarily large reversible recognizers possessing no nontrivial reversible congruence. However, the...
متن کاملComplex polynomial vector fields having a finitely curved orbit
In this paper we address the following questions: (i) Let C ⊂ C be an orbit of a polynomial vector field which has finite total Gaussian curvature. Is C contained in an algebraic curve? (ii) What can be said of a polynomial vector field which has a finitely curved transcendent orbit? We give a positive answer to (i) under some non-degeneracy conditions on the singularities of the projective fol...
متن کاملSparse Polynomial Interpolation with Finitely Many Values for the Coefficients
In this paper, we give new sparse interpolation algorithms for black box polynomial f whose coefficients are from a finite set. In the univariate case, we recover f from one evaluation of f(β) for a sufficiently large number β. In the multivariate case, we introduce the modified Kronecker substitution to reduce the interpolation of a multivariate polynomial to the univariate case. Both algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2016
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2015.10.063